LaTe, a Non-fully Deterministic Testing Language
نویسندگان
چکیده
This paper presents a case study which is the test of a voicebased service. To develop this application, we propose new functionalities for testing languages and a new language called LaTe that implements them. With LaTe, one testing scenario can describe several different executions and the interpreter tries to find the execution that best fits with the real behavior of the System Under Testing (SUT). We propose an operational semantics of these non-deterministic operators. Experimental results of the test of the voice-based service are also included.
منابع مشابه
Non-deterministic Lazy It -calculus Vs It -caculus Non-deterministic Lazy -calculus Vs -calculus
We pursue the study of the embedding of the-calculus into the-calculus. Various lambda calculi with parallel and convergence testing facilities are examined and their expressiveness compared; j-a lazy calculus augmented with a non-deterministic choice operator and a convergence testing combinator, emerges as a suitable language to be encoded in. Through the use of closures for variables and abs...
متن کاملImplicational Scaling of Reading Comprehension Construct: Is it Deterministic or Probabilistic?
In English as a Second Language Teaching and Testing situations, it is common to infer about learners’ reading ability based on his or her total score on a reading test. This assumes the unidimensional and reproducible nature of reading items. However, few researches have been conducted to probe the issue through psychometric analyses. In the present study, the IELTS exemplar module C (1994) wa...
متن کاملA Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation
This paper is about the relationship between the theory of monadic types and the practice of concurrent functional programming. We present a typed functional programming language CMML, with a type system based on Moggi’s monadic metalanguage, and concurrency based on Reppy’s Concurrent ML. We present an operational and denotational semantics for the language, and show that the denotational sema...
متن کاملAutomatic Testing from Formal Specifications
In this article, we consider model oriented formal specification languages. We generate test cases by performing symbolic execution over a model, and from the test cases obtain a Java program. This Java program acts as a test driver and when it is run in conjunction with the implementation then testing is performed in an automatic manner. Our approach makes the testing cycle fully automatic. Th...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کامل